Encryption using circular harmonic key

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Public–Key Encryption using Decoder Algorithm

With the ever increasing confidential data being sent on the fast spreading computer networks the security aspect has become the focal point. One of the methods that has been used for various applications is the public-key encryption technique, which has been used with fair success. However, sound public-key cryptosystems are yet to be developed and a lot of work is focused on to this aspect of...

متن کامل

Public key encryption using block ciphers

A method for deriving a public key encryption system from any ‘conventional’ (secret key) block cipher is described. The method is related to, but improves upon, Merkle’s ’puzzle system’.

متن کامل

802.11i Encryption Key Distribution Using Quantum Cryptography

Quantum cryptography is a promising solution towards absolute security in long term cryptosystems. While the use of quantum cryptography in fiber optical networks gets significant advances, research on the application of quantum cryptography in mobile wireless network is still premature. In this paper, we analyze the interests of using quantum cryptography in 802.11 wireless networks, and propo...

متن کامل

Public-key Encryption with Masking Public-key Encryption with Masking

Timed-release encryption, first mentioned by May [12] and discussed by Rivest, Shamir, and Wanger [15], is a cryptographic primitive which enables us to “send a message into the future.” We take a simple approach, called public-key encryption with masking, in order to realize this requirement. In our model, the sender first encrypts a plaintext and “masks” the ciphertext, then send it the recei...

متن کامل

Public Key Encryption and Encryption Emulation Attacks

The main purpose of this paper is to show that public key encryption can be secure against the “encryption emulation” attack (on the sender’s encryption) by computationally unbounded adversary, with one reservation: a legitimate receiver decrypts correctly with probability that can be made arbitrarily close to 1, but not equal to 1. 1. Summary of our claims We thought it would make sense to sum...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: DYNA

سال: 2015

ISSN: 2346-2183,0012-7353

DOI: 10.15446/dyna.v82n190.42915